Canonicity for Cubical Type Theory

نویسنده

  • Simon Huber
چکیده

Cubical type theory is an extension of Martin-Löf type theory recently proposed by Cohen, Coquand, Mörtberg and the author which allows for direct manipulation of n-dimensional cubes and where Voevodsky’s Univalence Axiom is provable. In this paper we prove canonicity for cubical type theory: any natural number in a context build from only name variables is judgmentally equal to a numeral. To achieve this we formulate a typed and deterministic operational semantics and employ a computability argument adapted to a presheaf-like setting.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Higher Type Theory III: Univalent Universes and Exact Equality

This is the third in a series of papers extending Martin-Löf’s meaning explanations of dependent type theory to a Cartesian cubical realizability framework that accounts for higherdimensional types. We extend this framework to include a cumulative hierarchy of univalent Kan universes of Kan types; exact equality and other pretypes lacking Kan structure; and a cumulative hierarchy of pretype uni...

متن کامل

Higher Inductive Types in Cubical Computational Type Theory

In homotopy type theory (HoTT), higher inductive types provide a means of defining and reasoning about higher-dimensional objects such as circles and tori. The formulation of a schema for such types remains a matter of current research. We investigate the question in the context of cubical type theory, where the homotopical structure implicit in HoTT is made explicit in the judgmental apparatus...

متن کامل

Cartesian Cubical Computational Type Theory

We present a dependent type theory organized around a Cartesian notion of cubes (with faces, degeneracies, and diagonals), supporting both fibrant and non-fibrant types. The fibrant fragment includes Voevodsky’s univalence axiom and a circle type, while the non-fibrant fragment includes exact (strict) equality types satisfying equality reflection. Our type theory is defined by a semantics in cu...

متن کامل

Computational Higher Type Theory II: Dependent Cubical Realizability

This is the second in a series of papers extending Martin-Löf’smeaning explanation of dependent type theory to account for higher-dimensional types. We build on the cubical realizability framework for simple types developed in Part I, and extend it to a meaning explanation of dependent higher-dimensional type theory. This extension requires generalizing the computational Kan condition given in ...

متن کامل

Computational Higher Type Theory IV: Inductive Types

This is the fourth in a series of papers extending Martin-Löf’s meaning explanation of dependent type theory to higher-dimensional types. In this installment, we show how to define cubical type systems supporting a general schema of cubical inductive types, inductive types whose constructors may take dimension parameters and may have specified boundaries. Using this schema, we are able to speci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1607.04156  شماره 

صفحات  -

تاریخ انتشار 2016